Pareto-Optimality of the Balinski Cut for the Uncapacitated Facility Location Problem
نویسندگان
چکیده
The classical 1962 Benders decomposition scheme is a traditional approach for solving mixed-integer problems such as the uncapacitated facility location problem. Subsequent research has been focused on finding better cutting-plane generation schemes to reduce the solution process time. Pareto-optimal cuts are typically preferred because no other cut can dominate them. However, the Pareto-optimal cut generation process typically requires running a separate linear program at each iteration to determine the appropriate dual variables. It is proven here that the dual variable selection scheme proposed in 1965 by Balinski will generate cuts that are always Pareto-optimal for the uncapacitated facility location problem and can be easily generated without running a time-consuming second linear program at each iteration. Direct comparisons between Benders cuts and Balinski cuts for 25 classical problems from the literature provided an empirical indication of the relative advantage of employing Balinski cuts. KeywordsInteger programming, Facility location, Decomposition, Cutting planes, Facet generation ∗ Corresponding author’s email: [email protected]
منابع مشابه
Cuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملA hybrid DEA-based K-means and invasive weed optimization for facility location problem
In this paper, instead of the classical approach to the multi-criteria location selection problem, a new approach was presented based on selecting a portfolio of locations. First, the indices affecting the selection of maintenance stations were collected. The K-means model was used for clustering the maintenance stations. The optimal number of clusters was calculated through the Silhou...
متن کاملRobust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations
The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...
متن کاملEvaluating the Effectiveness of Integrated Benders Decomposition Algorithm and Epsilon Constraint Method for Multi-Objective Facility Location Problem under Demand Uncertainty
One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...
متن کاملMemetic Algorithm for Solving the Multilevel Uncapacitated Facility Location Problem
We consider the Multilevel Uncapacitated Facility Location Problem (MLUFLP) and propose a new efficient integer programming formulation of the problem that provides optimal solutions for theMLUFLP test instances unsolved to optimality up to now. Further, we design a parallel Memetic Algorithm (MA) with a new strategy for applying the local search improvement within the MA frame. The conducted c...
متن کامل